A heuristic for minimizing weighted carry-over effects in round robin tournaments
نویسندگان
چکیده
The carry-over effects value is one of the various measures one can consider to assess the quality of a round robin tournament schedule. We introduce and discuss a new, weighted variant of the minimum carry-over effects value problem. The problem is formulated by integer programming and an algorithm based on the hybridization of the Iterated Local Search metaheuristic with a multistart strategy is proposed. Numerical results are presented.
منابع مشابه
Global constraints for round robin tournament scheduling
In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...
متن کاملMinimizing the Carry-Over Effects Value in a Round-Robin Tournament
In this abstract, we deal with the problem of minimizing the carry-over effects value in a round-robin tournament. The carry-over effects value is an index of quality of a round-robin tournament schedule. We propose an effective algorithm for generating schedules of small carry-over effects values. The proposed algorithm produces better schedules than the previous best ones in short computation...
متن کاملHard real-time communications with weighted round robin service in ATM local area networks
In this paper, we address issues related to providing guaranteed real-time communication in ATM local area networks. We concentrate on output link scheduling because it plays a critical role in meeting message deadlines. We are particularly interested in the weighted round robin scheduling policy because of its simple design and implementation. To use weighted round robin scheduling for hard re...
متن کاملOn the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information
We study the computational complexity of optimal bribery and manipulation schemes for sports tournaments with uncertain information: cup; challenge or caterpillar; and round robin. Our results carry over to the equivalent voting rules: sequential pair-wise elections, cup, and Copeland, when the set of candidates is exactly the set of voters. This restriction creates new difficulties for most ex...
متن کاملA simple and effective scheduling mechanism using minimized cycle round robin
packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Scheduling
دوره 14 شماره
صفحات -
تاریخ انتشار 2011